A Substructural Epistemic Resource Logic
نویسندگان
چکیده
We present a substructural epistemic logic, based on Boolean BI, in which the epistemic modalities are parametrized on agents’ local resources. The new modalities can be seen as generalizations of the usual epistemic modalities. The logic combines Boolean BI’s resource semantics with epistemic agency. We give a labelled tableaux calculus and establish soundness and completeness with respect to the resource semantics. We illustrate the use of the logic by discussing an example of side-channels in access control using resource tokens.
منابع مشابه
A Substructural Epistemic Resource Logic ( Extended Version ) 17 October , 2016 Didier Galmiche Pierre Kimmel
We present a substructural epistemic logic, based on Boolean BI, in which the epistemic modalities are parametrized on agents’ local resources. The new modalities can be seen as generalizations of the usual epistemic modalities. The logic combines Boolean BI’s resource semantics with epistemic agency. We give a labelled tableaux calculus and establish soundness and completeness with respect to ...
متن کاملA Substructural Epistemic Resource Logic and Its Use in Systems Security Modelling
We present a substructural epistemic logic, based on Boolean BI, in which the epistemic modalities are parametrized on the agent’s local resource. The new modalities can be seen as generalizations of the usual epistemic modalities. The logic combines Boolean BI’s resource semantics with epistemic agency. We give a labelled tableaux calculus and establish soundness and completeness with respect ...
متن کاملSubstructural epistemic logics
In many common epistemic scenarios, the warrant provided by the body of evidence available to an agent does not seem to be closed under classical consequence. It may be the case that evidence gathered during a criminal investigation provides inconsistent information without thereby supporting the existence of extraterrestrials. It may be the case that an agent has gathered enough evidence to se...
متن کاملA Proof Search System for a Modal Substructural Logic Based on Labelled Deductive Systems
This paper describes a proof search system for a non{classical logic (modal concatenation (substructural) logic) based on Gabbay's Labelled Deductive System (LDS). The logic concerned is treated as a case study. It has some unusual features which combine resource (linear, Lambek Calculus or relevance logics) with modality (intensional, temporal, or epistemic logics), and may have some useful ap...
متن کاملSubstructural modal logic for optimal resource allocation
We introduce a substructural modal logic for reasoning about (optimal) resource allocation in models of distributed systems. The underlying logic is a variant of the modal logic of bunched implications, and based on the same resource semantics, which is itself closely related to concurrent separation logic. By considering notions of cost, strategy, and utility, we are able to formulate characte...
متن کامل